Circular colorings of edge-weighted graphs
نویسنده
چکیده
The notion of (circular) colorings of edge-weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds to the traveling salesman problem (metric case). It also gives rise to a new definition of the chromatic number of directed graphs. Several basic results about the circular chromatic number of edge-weighted graphs are derived.
منابع مشابه
Hajj Os Theorem for Colorings of Edge-weighted Graphs
Hajj os theorem states that every graph with chromatic number at least k can be obtained from the complete graph K k by a sequence of simple operations such that every intermediate graph also has chromatic number at least k. Here, Hajj os theorem is extended in three slightly diierent ways to colorings and circular colorings of edge-weighted graphs. These extensions shed some new light on the H...
متن کاملHajós Theorem For Colorings Of Edge-Weighted Graphs
Hajj os theorem states that every graph with chromatic number at least k can be obtained from the complete graph K k by a sequence of simple operations such that every intermediate graph also has chromatic number at least k. Here, Hajj os theorem is extended in three slightly diierent ways to colorings and circular colorings of edge-weighted graphs. These extensions shed some new light on the H...
متن کاملA Dynamic View of Circular Colorings
The main contributions of this paper are three-fold. First, we use a dynamic approach based on Reiter’s pioneering work on Karp-Miller computation graphs [19] to give a new and short proof of Mohar’s Minty-type Theorem [15]. Second, we bridge circular colorings and discrete event dynamic systems to show that the Barbosa and Gafni’s results on circular chromatic number [5, 21] can be generalized...
متن کاملSkew Chromatic Index of Circular Ladder Graphs
Abstract. A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, an algorithm is determined for skew edge coloring of circular ladder graphs. Alsothe skew chromatic index of circular la...
متن کاملColoring Fuzzy Circular Interval Graphs
Given a graph G with nonnegative node labels w, a multiset of stable sets S1, . . . , Sk ⊆ V (G) such that each vertex v ∈ V (G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number χw(G) is the smallest k such that there exist stable sets as above. We provide a polynomial time combinatorial algorithm that computes the weighted coloring numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 43 شماره
صفحات -
تاریخ انتشار 2003